-
1 discard algorithm
алгоритм виключення (напр. компонентів в регулярних ВІС)English-Ukrainian dictionary of microelectronics > discard algorithm
-
2 algorithm
- aim algorithm
- automatic placement and routing algorithm
- backward error recovery algorithm
- best path algorithm
- bit-map oriented spatial processing algorithm
- block-oriented algorithm
- branch and bound algorithm
- channel algorithm
- D algorithm
- deductive algorithm
- discard algorithm
- exact embedding algorithm
- expansion algorithm
- fast-Fourier-transform algorithm
- graph-based algorithm
- Gummel’s algorithm
- hidden-line algorithm
- image processing algorithm
- iterative algorithm
- Lee algorithm
- min-cut algorithm
- modified Lee algorithm
- N-step algorithm
- one-direction algorithm
- pessimistic simulation algorithm
- random-search algorithm
- repair-most algorithm
- Roth’s D algorithm
- routing algorithm
- Schonhage algorithm
- selective-trace algorithm
- sequential algorithm
- stable sorting algorithm
- star algorithm
- table-driven algorithm
- 9-value D- algorithm
- wiring algorithmEnglish-Ukrainian dictionary of microelectronics > algorithm
См. также в других словарях:
Rete algorithm — The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems. The Rete algorithm was designed by Dr Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later… … Wikipedia
Kruskal's algorithm — is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is… … Wikipedia
Random early discard — Die Artikel Überlastkontrolle, Network congestion avoidance und Random early detection überschneiden sich thematisch. Hilf mit, die Artikel besser voneinander abzugrenzen oder zu vereinigen. Beteilige dich dazu an der Diskussion über diese… … Deutsch Wikipedia
Cache algorithms — This article is about general cache algorithms. For detailed algorithms specific to paging, see page replacement algorithm. For detailed algorithms specific to the cache between a CPU and RAM, see CPU cache. In computing, cache algorithms (also… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Asynchronous Transfer Mode — In electronic digital data transmission systems, the network protocol Asynchronous Transfer Mode (ATM) encodes data traffic into small fixed sized cells. The standards for ATM were first developed in the mid 1980s. The goal was to design a single … Wikipedia
Список RFC — Здесь представлен список RFC (документ запроса комментариев). Поскольку на данный момент их существует более 5000, то в данном списке представлены лишь наиболее значимые из них, по которым существуют связанные с ними статьи. Содержание 1 RFC по… … Википедия
Rotation matrix — In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian… … Wikipedia
Fisher-Yates shuffle — The Fisher Yates shuffle, named after Ronald Fisher and Frank Yates, also known as the Knuth shuffle, after Donald Knuth, is an algorithm for generating a random permutation of a finite set in plain terms, for randomly shuffling the set. A… … Wikipedia
Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
